Sparsity Adaptive Matching Pursuit Detection Algorithm Based on Compressed Sensing for Radar Signals
نویسندگان
چکیده
In this paper, the application of the emerging compressed sensing (CS) theory and the geometric characteristics of the targets in radar images are investigated. Currently, the signal detection algorithms based on the CS theory require knowing the prior knowledge of the sparsity of target signals. However, in practice, it is often impossible to know the sparsity in advance. To solve this problem, a novel sparsity adaptive matching pursuit (SAMP) detection algorithm is proposed. This algorithm executes the detection task by updating the support set and gradually increasing the sparsity to approximate the original signal. To verify the effectiveness of the proposed algorithm, the data collected in 2010 at Pingtan, which located on the coast of the East China Sea, were applied. Experiment results illustrate that the proposed method adaptively completes the detection task without knowing the signal sparsity, and the similar detection performance is close to the matching pursuit (MP) and orthogonal matching pursuit (OMP) detection algorithms.
منابع مشابه
A Modified Regularized Adaptive Matching Pursuit Algorithm for Linear Frequency Modulated Signal Detection Based on Compressive Sensing
Compressive Sensing (CS) is a novel signal sampling theory under the condition that the signal is sparse or compressible. It has the ability of compressing a signal during the process of sampling. Reconstruction algorithm is one of the key parts in compressive sensing. We propose a novel iterative greedy algorithm for reconstructing sparse signals, called Modified Regularized Adaptive Matching ...
متن کاملA New Method for Ground Moving Targets Tracking Using Radar Based on Compressed Sensing
In this paper, we propose a Compressed Sensing (CS) based method under the unknown sparse degree to track ground moving targets using Pulse-Doppler (PD) radar. We use the sparsity of delay-Doppler plane in the process of disposing PD radar echo to set up a sparse signal model in each pulse interval. At the state prediction stage, we can get the predicted values of target states by dynamic equat...
متن کاملNoise Resilient Recovery Algorithm for Compressed Sensing
In this article, we discuss a novel greedy algorithm for the recovery of compressive sampled signals under noisy conditions. Most of the greedy recovery algorithms proposed in the literature require sparsity of the signal to be known or they estimate sparsity, for a known representation basis, from the number of measurements. These algorithms recover signals when noise level is significantly lo...
متن کاملEnhanced joint sparsity via Iterative Support Detection
Compressed sensing (CS) [1, 2] demonstrates that sparse signals can be recovered from underdetermined linear measurements. The idea of iterative support detection (ISD, for short) method first proposed by Wang et. al [3] has demonstrated its superior performance for the reconstruction of the single channel sparse signals. In this paper, we extend ISD from sparsity to the more general structured...
متن کاملMultichannel and Wide-Angle SAR Imaging Based on Compressed Sensing
The multichannel or wide-angle imaging performance of synthetic aperture radar (SAR) can be improved by applying the compressed sensing (CS) theory to each channel or sub-aperture image formation independently. However, this not only neglects the complementary information between signals of each channel or sub-aperture, but also may lead to failure in guaranteeing the consistency of the positio...
متن کامل